A Classification of First-Order Progressable Action Theories in Situation Calculus
نویسندگان
چکیده
Projection in the situation calculus refers to answering queries about the future evolutions of the modeled domain, while progression refers to updating the logical representation of the initial state so that it reflects the changes due to an executed action. In the general case projection is not decidable and progression may require second-order logic. In this paper we focus on a recent result about the decidability of projection and use it to drive results for the problem of progression. In particular we contribute with the following: (i) a major result showing that for a large class of intuitive action theories with bounded unknowns a first-order progression always exists and can be computed; (ii) a comprehensive classification of the known classes that can be progressed in first-order; (iii) a novel account of nondeterministic actions in the situation calculus.
منابع مشابه
On First-Order μ-Calculus over Situation Calculus Action Theories
In this paper we study verification of situation calculus action theories against first-order μ-calculus with quantification across situations. Specifically, we consider μLa and μLp, the two variants of μ-calculus introduced in the literature for verification of data-aware processes. The former requires that quantification ranges over objects in the current active domain, while the latter addit...
متن کاملSynchronous Games in the Situation Calculus
We develop a situation calculus-based account of multi-player synchronous games. These are represented as action theories called situation calculus synchronous game structures (SCSGSs) that involve a single action tick whose effects depend on the combination of moves chosen by the players. Properties of games, e.g., winning conditions, playability, weak and strong winnability, etc. can be expre...
متن کاملProgression and verification of situation calculus agents with bounded beliefs
In this paper we investigate agents that have incomplete information and make decisions based on their beliefs, expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently it has been shown that verifying temporal properties over such theories i...
متن کاملBounded Situation Calculus Action Theories and Decidable Verification
We define a notion of bounded action theory in the situation calculus, where the theory entails that in all situations, the number of ground fluent atoms is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We argue that such theories are fairly common in applications, either because facts do not persist indefinitely or because one eventually ...
متن کاملBounded Epistemic Situation Calculus Theories
We define the class of e-bounded theories in the epistemic situation calculus, where the number of fluent atoms that the agent thinks may be true is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We show that for them verification of an expressive class of first-order μ-calculus temporal epistemic properties is decidable. We also show that ...
متن کامل